Stochastic Online Scheduling With Preemption Penalties
نویسندگان
چکیده
منابع مشابه
On-line production order scheduling with preemption penalties
This paper studies the on-line production order scheduling problem where each preemption causes a penalty, and the objective is to maximize the net profit, i.e., the total weights of completed orders minus the total penalties caused by preemptions. Two greedy strategies are shown to be at best O( 2) and (4 + 2 √4 + 1/ + 1)competitive respectively, where is the ratio between the longest and shor...
متن کاملOptimality of Index Policies for Stochastic Scheduling with Switching Penalties
We investigate the impact of switching penalties on the nature of optimal scheduling policies for systems of parallel queues without arrivals. We study two types of switching penalties incurred when switching between queues: lump sum costs and time delays. Under the assumption that the service periods of jobs in a given queue possess the same distribution, we derive an index rule that deenes an...
متن کاملOptimal Stochastic Scheduling of Forest Networks with Switching Penalties 1
We present structural properties of optimal policies for the problem of scheduling a single server in a forest network of N queues (without arrivals) subject to switching penalties. In addition to linear holding costs, we impose either lump sum switching costs or batch setup delays which are incurred at each instant the server processes a job in a queue diierent than the previous one. We use re...
متن کاملStochastic Online Scheduling Revisited
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give randomized as well as deterministic online and off-line algorithms that have the best known performance guarantees in either setting, deterministic and offline or randomized and online. Our analysis is based on a nov...
متن کاملStochastic Online Scheduling with Precedence Constraints
We consider the preemptive and non-preemptive problems of scheduling jobs with precedence constraints on parallel machines with the objective to minimize the sum of (weighted) completion times. We investigate an online model in which the scheduler learns about a job when all its predecessors have completed. For scheduling on a single machine, we show matching lower and upper bounds of Θ(n) and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics and Computer Science
سال: 2013
ISSN: 2008-949X
DOI: 10.22436/jmcs.06.03.08